Authentication Codes
نویسندگان
چکیده
The Prêt à Voter end-to-end verifiable voting system makes use of receipts, retained by voters, to provide individual verifiability that their vote has been recorded as cast. The paper discusses issues around the production and acceptance of receipts, and presents an alternative approach to individual verifiability based on Authentication Codes. These codes are constructed, in the encrypted domain, by the peered Web Bulletin Board when the vote is cast, and provide the voter with an assurance that their vote has been properly received. The approach is designed to work in a uniform way with ranked elections and single preference elections.
منابع مشابه
Linear Authentication Codes from Free Modules: Bounds and Constructions
In this paper, we principally introduce a new class of unconditionally secure authentication codes, called linear authentication codes(or linear A-codes)from free modules. We then derive an upper bound on the size of source space when other parameters of the system, that is, the sizes of the key space and authenticator space, and the deception probability are fixed. We give constructions that a...
متن کاملCombinatorial Characterizations of Authentication Codes
In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs.
متن کاملAuthentication codes from generalized quadrangles
Authentication codes were introduced by Simmons in [3]. Many combinatorial structures can be used to construct authentication codes, and interesting combinatorial bounds can be obtained, see e.g. [7], [8] and [9]. We investigate authentication codes arising from generalized quadrangles (GQs), which was first done in [1]. The use of intricated techniques and constructions from the theory of GQs ...
متن کاملTwo Constructions of Multireceiver Authentication Codes from Singular Symplectic Geometry over Finite Fields
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, two constructions of multireceiver authentication codes from singular symplectic geometry over finite fields are given. The parameters and the probabilities of success for different types of dec...
متن کاملIntroducing Robustness into Message Authentication
Message Authentication Codes are very sensitive to any change of the message they are appended to. If one or more bits of the message change, Message Authentication Codes change about 50\% of their bits, making the message useless. The successful verification of Message Authentication Codes demands equality of all of bits of the received Message Authentication Code and that one recalculated of ...
متن کاملMethod to Construct A-Codes from A-Codes
Another important idea in the study of codes is the relation between authentication codes with arbitration and authentication codes without arbitration. Nowadays there is no much work about this relation, very few authors have studied it. Then in this paper we are going to study this relation and come out some important results. For this cause we established and proved two theorems, which provi...
متن کامل